New solvable many-body problems in the plane
نویسنده
چکیده
We revisit an integrable (indeed, superintegrable and solvable) many-body model introduced almost two decades ago by Gibbons and Hermsen and by Wojciechowski, and we modify it so that its generic solutions are all isochronous (namely, completely periodic with fixed period). We then show how this model (or rather the more basic dynamical system that underlies its solvable character, and other avatars of it) can be conveniently reinterpreted as (rotation-invariant) models in the plane; and we thereby present several new (solvable, isochronous and rotation-invariant) many-body problems in the plane.
منابع مشابه
A New Class of Solvable Many-Body Problems
A new class of solvable N -body problems is identified. They describe N unitmass point particles whose time-evolution, generally taking place in the complex plane, is characterized by Newtonian equations of motion “of goldfish type” (acceleration equal force, with specific velocity-dependent one-body and two-body forces) featuring several arbitrary coupling constants. The corresponding initial-...
متن کاملA Solvable Many-Body Problem in the Plane
A solvable many-body problem in the plane is exhibited. It is characterized by rotation-invariant Newtonian (“acceleration equal force”) equations of motion, featuring one-body (“external”) and pair (“interparticle”) forces. The former depend quadratically on the velocity, and nonlinearly on the coordinate, of the moving particle. The latter depend linearly on the coordinate of the moving parti...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملDesigning Solvable Graphs for Multiple Moving Agents
Solvable Graphs (also known as Reachable Graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). In this paper, the properties of Solvable Graphs are investigated, and a new concept in multi agent moti...
متن کاملThree New Classes of Solvable N-Body Problems of Goldfish Type with Many Arbitrary Coupling Constants
Abstract: Three new classes of N-body problems of goldfish type are identified, with N an arbitrary positive integer (N ě 2). These models are characterized by nonlinear Newtonian (“accelerations equal forces”) equations of motion describing N equal point-particles moving in the complex z-plane. These highly nonlinear equations feature many arbitrary coupling constants, yet they can be solved b...
متن کامل